Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
نویسنده
چکیده
In the maximum edge-disjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edge-disjoint paths. We give a survey of known results about the complexity and approximability of MEDP and sketch some of the main ideas that have been used to obtain approximation algorithms for the problem. We consider also the generalization of MEDP where the edges of the graph have capacities and each request has a profit and a demand, called the unsplittable
منابع مشابه
Exact and Approximation Algorithms for Network Flow and Disjoint - Path Problems
Network flow problems form a core area of Combinatorial Optimization. Their significance arises both from their very large number of applications and their theoretical importance. This thesis focuses on efficient exact algorithms for network flow problems in P and on approximation algorithms for NP -hard variants such as disjoint paths and unsplittable flow. Given an n-vertex, m-edge directed n...
متن کاملEdge-Disjoint Paths and Unsplittable Flow
Finding disjoint paths in graphs is a problem that has attracted considerable attention from at least three perspectives: graph theory, VLSI design and network routing/flow. The corresponding literature is extensive. In this chapter we limit ourselves mostly to results on offline approximation algorithms for problems on general graphs as influenced from the network flow perspective. Surveys exa...
متن کاملApproximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
The edge and vertex-disjoint path problems together with their unsplittable flow generalization are NP-hard problems with a multitude of applications in areas such as routing, scheduling and bin packing. Given the hardness of the problems, we study polynomial-time approximation algorithms with bounded performance guarantees. We introduce techniques which yield new algorithms for a wide range of...
متن کاملSingle-Source Unsplittable Flow
The max-ow min-cut theorem of Ford and Fulkerson is based on an even more foundational result, namely Menger's theorem on graph connectivity. Menger's theorem provides a good characterization for the following single{source disjoint paths problem: given a graph G, with a source vertex s and terminals t 1 ; : : :; t k , decide whether there exist edge{disjoint s-t i paths, for i = 1; : : :; k. W...
متن کاملApproximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
We study the Unsplittable Flow Problem (UFP) and related variants, namely UFP with Bag Constraints and UFP with Rounds, on paths and trees. We provide improved constant factor approximation algorithms for all these problems under the no bottleneck assumption (NBA), which says that the maximum demand for any source-sink pair is at most the minimum capacity of any edge. We obtain these improved r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006